Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults
نویسندگان
چکیده
∆-Timed Atomic Broadcast is the broadcast ensuring that all correct processes deliver the same messages in the same order, and that delivery latency of any message broadcast by any correct process is some predetermined time ∆ or less. In this paper, we propose a ∆-timed atomic broadcast algorithm in a synchronous system where communication delay is bounded by a known constant d and processes suffer both crash faults and timing faults. The proposed algorithm can tolerate fc crash faults and ft timing faults as long as at least ft + 1 processes are correct, and its maximum delivery latency ∆ is (2 f ′ + 7)d where f ′ is the actual number of (crash or timing) faulty processes. That is, the algorithm attains the earlydelivery in the sense that its delivery latency depends on the actual number of faults rather than the maximum number of faults that the algorithm can tolerate. Moreover, the algorithm has a distinct advantage of guaranteeing that timing-faulty processes also deliver the same messages in the same order as the correct processes (Uniformity). We also investigate the maximum number of faulty processes that can be tolerated. We show that no ∆-timed atomic broadcast algorithm can tolerate ft timing faults, if at most ft processes are correct. The impossibility result implies that the proposed algorithm achieves the maximum fault-resilience with respect to the number of faulty processes. key words: timed atomic broadcast, fault tolerance, timing fault, crash fault
منابع مشابه
Adaptive timeliness of consensus in presence of crash and timing faults
The ∆-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: Every correct process terminates its execution within a constant time ∆ (∆-timeliness), and no two processes decide differently (Uniformity). In this paper, we consider the ∆-timed uniform consensus problem in presence of fc crash processes and ft timing-faulty pr...
متن کاملReal-Time Fault-Tolerant Atomic Broadcast
We present algorithms for Real-Time Fault-Tolerance Uniform Atomic Broadcast developed in the framework of the French project ATR (accord temps réel). We first design a distributed execution model for asynchronous systems with crash failure we called Synchronized Phase System (SPS), then we give an algorithm for Atomic Broadcast in SPS. In a SPS, the processes try to run in synchronized rounds ...
متن کاملA weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
The consensus problem is one of the most fundamental and important problems for designing fault-tolerant distributed systems. In the consensus problem, each process proposes a value, and all non-faulty processes have to agree on a common value that is proposed by a process. Despite of many applications (e.g., atomic broadcast [2, 6], shared object [1, 7], weak atomic commitment [5]), it is know...
متن کاملGroup, Majority, and Strict Agreement in Timed Asynchronous Distributed Systems
Atomic broadcast is a group communication service that enables a team of distributed processes to keep replicated datàconsistent', despite concurrency, communication uncertainty, failures and recoveries. We investigate possible meanings for replicated datàconsistency' in timed asynchronous systems, subject to crash/performance process failures and omis-sion/performance communication failures wh...
متن کاملHigh-performance asynchronous atomic broadcast
We describe two families of asynchronous atomic broadcast protocols that provide good delivery and stability times, use a small number of messages to accomplish a broadcast, distribute the load of ordering messages evenly among group members, use efficient flow-control techniques, and provide gracefully degraded performance in the presence of communication failures. The pinwheel protocols are d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-D شماره
صفحات -
تاریخ انتشار 2005